A branch‐and‐price algorithm for parallel machine scheduling with time windows and job priorities

This paper presents a branch‐and‐price algorithm for scheduling n jobs on m nonhomogeneous parallel machines with multiple time windows. An additional feature of the problem is that each job falls into one of ρ priority classes and may require two operations. The objective is to maximize the weighted number of jobs scheduled, where a job in a higher priority class has “infinitely” more weight or value than a job in a lower priority class. The methodology makes use of a greedy randomized adaptive search procedure (GRASP) to find feasible solutions during implicit enumeration and a two‐cycle elimination heuristic when solving the pricing subproblems. Extensive computational results are presented based on data from an application involving the use of communications relay satellites. Many 100‐job instances that were believed to be beyond the capability of exact methods, were solved within minutes. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

光学系统的副像及其消除方法的探讨

视准式光学系统瞄准具的成像有主像和副像两种情形,主像是对目标瞄准的必要标志,副像则对目标的瞄准产生不良影响,为消除或减弱光学系统所成的副像对瞄准精度的影响,主要分析了光学系统中中心反射镜的反射和有无平行差时产生副像的原因.提出了消除或减弱副像的多项措施,并针对中心反射镜提出了两种截然相反地改进方法.可有效地消除或减弱副像所引起的不良干扰对飞行人员视觉的影响,有效地提高了观察效果和瞄准精度.     

网格方程组并行计算预条件迭代若干性质及应用

对网格方程组作区域分裂并行计算 ;分析了预条件迭代谱条件的若干性质及其对算法收敛性的影响 ,为构造预处理提供了理论依据 ,并应用于区域分裂并行计算     

Solution algorithms for the parallel replacement problem under economy of scale

We consider the parallel replacement problem in which machine investment costs exhibit economy of scale which is modeled through associating both fixed and variable costs with machine investment costs. Both finite- and infinite-horizon cases are investigated. Under the three assumptions made in the literature on the problem parameters, we show that the finite-horizon problem with time-varying parameters is equivalent to a shortest path problem and hence can be solved very efficiently, and give a very simple and fast algorithm for the infinite-horizon problem with time-invariant parameters. For the general finite-horizon problem without any assumption on the problem parameters, we formulate it as a zero-one integer program and propose an algorithm for solving it exactly based on Benders' decomposition. Computational results show that this solution algorithm is efficient, i.e., it is capable of solving large scale problems within a reasonable cpu time, and robust, i.e., the number of iterations needed to solve a problem does not increase quickly with the problem size. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 279–295, 1998     

MC68HC05L9与TMS320C25并行处理在智能化仪器仪表中的应用

本文简要介绍了一种能用于智能化仪器仪表工业,由MC68HC05L9和TMS320C25两片微处理器组成的并行处理系统.该系统采用乒乓式RAM结构进行数据通讯,处理速度可达1100万次/秒.软硬件采用了抗干扰技术,具有成本低、性能高、结构简单等特点.稍加改进,也可应用于自动控制系统中.     

基于多层循环并行化的负载平衡优化

负载平衡是并行处理中的一个重要概念。参与一个程序执行的各处理机所承担的工作量是否均衡直接影响该程序的并行性能。本文对面向MPP系统程序循环级并行化中负载平衡的优化进行了探讨,提出了优化策略及其实施算法。     

判决元理论及其在武器分配中的应用

介绍了判决元理论的基本内容〔１〕,并将此理论用于解火控领域的武器分配问题（ＷｅａｐｏｎＡｓｓｉｇｎｍｅｎｔＰｒｏｂｌｅｍ,简称ＷＡＰ）,从而提出一种新的分配算法。通过２２个战例的仿真,结果表明,本算法收敛速度快,而且能收敛于理想的稳定状态。因此,在大规模的海战系统和高性能防空系统中,这种算法有着十分广阔的应用前景。     

可分椭圆型偏微分方程的 FACR(L)算法及其并行实现

文中就解Dirichlet 边界条件的Poisson 方程给出了FACR(L)算法及其并行实现过程,讨论了FACR(L)算法的计算复杂性,给出了针对向量机YH—1的算法的参数L 的优选公式,在YH—1机上得到了较为理想的,数值试验结果。     

基于内容的月球影像检索并行框架设计

基于内容的月球影像检索面向月球探测计划获取的大量遥感数据,根据影像视觉内容,提供一种方便而高效的检索方式。为提高其检索效率,在对基于内容的月球影像检索过程进行分析的基础上,运用Petri网完成过程建模与并行化分析。提出一种基于内容的月球影像检索并行框架,并据此部署实验系统,将嫦娥月球影像等实际数据集投入其中进行检索实验。结果表明,基于内容的月球影像检索并行框架能够有效提升查询检索效率。     

SPH并行计算方案及其在自由表面流动模拟中的应用

针对光滑粒子动力学主要计算量是近邻粒子搜索这一特点,提出了一种基于粒子分解的光滑粒子动力学并行计算方案。利用该方案可以方便地将任意串行光滑粒子动力学代码并行计算,而且每一个时间步内的信息传递量只和粒子总数有关,而和粒子的分布无关,因而特别适合于自由表面流动等大变形问题的并行数值模拟。对一个粒子总数为40万的三维溃坝问题的模拟结果表明:此方案能达到的最大加速比约为16,这一结果可能比空间分解方案(不考虑动态负载均衡)更优。